Minimum Ply Covering of Points with Unit Squares
نویسندگان
چکیده
Given a set P of points and U axis-parallel unit squares in the Euclidean plane, minimum ply cover with is subset that covers minimizes number share common intersection, called U. Biedl et al. [Comput. Geom., 94:101712, 2020] showed determining for by NP-hard, gave polynomial-time 2-approximation algorithm instances which constant. The question whether there exists approximation remained open when $$\omega (1)$$ . We settle this present $$(8+\varepsilon )$$ -approximation general problem, every fixed $$\varepsilon >0$$
منابع مشابه
Covering Points by Isothetic Unit Squares
Given a set P of n points in R, we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersecting (having empty common zone) such that they together cover maximum number of points. The time and space complexities of the proposed algorithm for this problem are both O(n). We also study the problem of computing k di...
متن کاملCovering Segments with Unit Squares
We study several variations of line segment covering problem with axis-parallel unit squares in IR. A set S of n line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give...
متن کاملOn Covering Points with Minimum Turns
For the rectilinear version of the problem in which the lines must be axis-parallel, • Hassin and Megiddo (1991) observed that the problem in R reduces to vertex cover in bipartite graphs and hence is solvable in polynomial time, and proved that the problem in R in NP-hard by a reduction from 3SAT, • Gaur and Bhattacharya (2007) presented a (d − 1)approximation algorithm for the problem in R fo...
متن کاملCovering Points with Disjoint Unit Disks
We consider the following problem. How many points must be placed in the plane so that no collection of disjoint unit disks can cover them? The answer, k, is already known to satisfy 11 ≤ k ≤ 53. Here, we improve the lower bound to 13 and the upper bound to 50. We also provide a set of 45 points that apparently cannot be covered, although this has been determined via computer search.
متن کاملMaximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of points of P . In case of overlapping, the points in their common zone are counted once. To solve the problem, we propose an algorithm that runs in O(n log n) time using O(n log n) space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-27051-2_3